Non-Determinism in Multi-Party Computation (Abstract)
نویسندگان
چکیده
Outside security, non-determinism is an important tool for specifying systems without fixing unnecessary details. In security, however, normal refinement of non-deterministic specifications is usually not applicable, in particular because it may invalidate secrecy properties. Especially simulatability-based security notions seem to require detailed deterministic or probabilistic specifications. We show how one can nevertheless use the reactive simulatability (RSIM) framework to address non-determinism. In particular we survey its generic distributed scheduling for treating the non-determinism of asynchronous execution, discuss the experiences we made with this, and how it encompasses other recent scheduling approaches. We also show how property-based specifications can play the role of highest-level nondeterminism in the RSIM context, and how functional non-determinism of machines can be captured by the system-from-structure derivations as well as by call-outs to the adversary or more general resolvers.
منابع مشابه
A duality between LM-fuzzy possibility computations and their logical semantics
Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...
متن کاملThe Exact Round Complexity of Secure Computation
We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message exchange channel, this question has been extensively studied and resolved. In particular, Katz and Ostrovsky (CRYPTO ’04) proved that five rounds are necessary and sufficient for securely realizing every two-party functionality ...
متن کاملRepresenting the Finite calculus in Multi Interaction Nets Concurrency Interaction Non determinism
We extend the Interaction Nets of Lafont with some non determinism capabilities and then show how to implement the nite monadic calculus in that system Introduction The calculus of Milner et al is one of the most popular theoretical tools for the investigation of concurrent computations Its popularity is due to its con ceptual simplicity yet great expressive power However similar to the calculu...
متن کاملThe Integrated Supply Chain of After-sales Services Model: A Multi-objective Scatter Search Optimization Approach
Abstract: In recent decades, high profits of extended warranty have caused that third-party firms consider it as a lucrative after-sales service. However, customers division in terms of risk aversion and effect of offering extended warranty on manufacturers’ basic warranty should be investigated through adjusting such services. Since risk-averse customers welcome extended warranty, while the cu...
متن کامل